Rotor-Router Aggregation on the Comb
نویسندگان
چکیده
We prove a shape theorem for rotor-router aggregation on the comb, for a specific initial rotor configuration and clockwise rotor sequence for all vertices. Furthermore, as an application of rotor-router walks, we describe the harmonic measure of the rotor-router aggregate and related shapes, which is useful in the study of other growth models on the comb. We also identify the shape for which the harmonic measure is uniform. This gives the first known example where the rotor-router cluster has non-uniform harmonic measure, and grows with different speeds in different directions.
منابع مشابه
Rotor-Router Aggregation on the Layered Square Lattice
In rotor-router aggregation on the square lattice Z2, particles starting at the origin perform deterministic analogues of random walks until reaching an unoccupied site. The limiting shape of the cluster of occupied sites is a disk. We consider a small change to the routing mechanism for sites on the xand y-axes, resulting in a limiting shape which is a diamond instead of a disk. We show that f...
متن کاملInternal aggregation models on comb lattices
The two-dimensional comb lattice C2 is a natural spanning tree of the Euclidean lattice Z. We study three related cluster growth models on C2: internal diffusion limited aggregation (IDLA), in which random walkers move on the vertices of C2 until reaching an unoccupied site where they stop; rotor-router aggregation in which particles perform deterministic walks, and stop when reaching a site pr...
متن کاملThe Rotor-Router Group of Directed Covers of Graphs
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we study several quantities related to rotor-router walks on directed covers. The quantities under consideration are: order of the rotor-router group, order of t...
متن کاملInfinite Excursions of Router Walks on Regular Trees
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a deterministic process: at each step it chooses the next unused rotor in its current location, and uses it to jump to the neighboring vertex to which it points. Rotor...
متن کاملSpherical Asymptotics for the Rotor-Router Model in Z
The rotor-router model is a deterministic analogue of random walk invented by Jim Propp. It can be used to define a deterministic aggregation model analogous to internal diffusion limited aggregation. We prove an isoperimetric inequality for the exit time of simple random walk from a finite region in Zd, and use this to prove that the shape of the rotor-router aggregation model in Zd, suitably ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011